Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

نویسندگان

چکیده

Graphs are powerful tools to model manufacturing systems and scheduling problems. The complexity of these their problems has been substantially increased by the ongoing technological development. Thus, it is essential generate sustainable graph-based modeling approaches deal with excessive complexities. employ nodes edges represent relationships between jobs, machines, operations, etc. Despite significant volume publications applying graphs shop problems, literature lacks a comprehensive survey study. We proposed first review paper which (1) systematically studies overview perspective this field, (2) highlights gaps potential hotspots literature, (3) suggests future research directions towards new intelligent/complex systems. carefully examined 143 peer-reviewed journal papers published from 2015 2020. About 70% our dataset were in top-ranked journals confirms validity data can imply importance field. After discussing generic collection methodology, we categorizations over properties solutions. Then, discussed novel categorization variety Finally, as most important contribution, generated creative scratch accompanied statistical analysis on dataset. Our showed attention job (56%) Un/Directed (52%) where be either directed, or undirected, both, Whereas 14% applied only Undirected 11% targeted hybrid systems, e.g., mixed shop, flexible, cellular shows directions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

متن کامل

modeling and scheduling no-idle hybrid flow shop problems

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Flexible Job-Shop Scheduling Problems

Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...

متن کامل

Timed Event Graph-based Scheduling for Cyclic Permutation Flow Shop

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11114741